import java.util.Scanner;

//5.7又是开心的一天 nice
public class Main{
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String str1 = sc.nextLine();
            String str2 = sc.nextLine();
            System.out.println(AddLongInteger(str1,str2));
        }
    }
    
    public static String AddLongInteger(String addend, String augend){
        //1.将两个大整数字符串用数组逆序存储
        char[] arr1 = new StringBuffer(addend).reverse().toString().toCharArray();
        char[] arr2 = new StringBuffer(augend).reverse().toString().toCharArray();
        
        //2.构建result数组，数组长度为较大整数位数加1（可能存在进位情况）
        int maxLength = arr1.length > arr2.length ? arr1.length : arr2.length;
        int[] result = new int[maxLength+1];
        
        //3.遍历数组，按位相加
        for(int i = 0; i < result.length; i++){
            int tmp = result[i];
            if(i < arr1.length){
                tmp += arr1[i] - '0';
            }
            if(i < arr2.length){
                tmp += arr2[i] - '0';
            }
            //判断是否进位
            if(tmp >= 10){
                tmp = tmp - 10; 
                result[i+1] = 1;
            }
            result[i] = tmp; 
        }
        
        //4.把result数组再次逆序转成String
        StringBuffer str = new StringBuffer();
        //判断最后一位是否发生了进位
        int head = result.length-1;
        if(result[result.length-1] == 0){
            head = result.length-2;
        }
        for(int i = head; i >= 0; i--){
            str.append(result[i]);
        }
        return str.toString();
    }
}